Partitioning 1-variable Boolean functions for various classification of n-variable Boolean functions

نویسندگان

  • Ranjeet Kumar Rout
  • Pabitra Pal Choudhury
  • Sudhakar Sahoo
  • Camellia Ray
چکیده

Partitioning 1-variable Boolean functions for various classification of nvariable Boolean functions Ranjeet Kumar Rout, Pabitra Pal Choudhury, Sudhakar Sahoo & Camellia Ray a Applied Statistics Unit, Indian Statistical Institute, Kolkata-700108, India; b Institute of Mathematics and Applications, Bhubaneswar-751003, India Accepted author version posted online: 14 Oct 2014.Published online: 14 Nov 2014.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Classification of n Variable Boolean Functions through Hamming Distance and their Application in System Biology

In this article, a noble approach is presented to classify n-variable Boolean functions in logical way such that each function belonging to a particular class can be traced with respect to a single base function. In the present study, two different methods have been proposed for this classification. The first one is done through the Hamming distance with regards to base 0 (2^n bits of zeros) Bo...

متن کامل

Boolean Functions: Influence, threshold and noise

This lecture studies the analysis of Boolean functions and present a few ideas, results, proofs, and problems. We start with the wider picture of expansion in graphs and then concentrate on the graph of the n-dimensional discrete cube Ωn. Boolean functions are functions from Ωn to {0, 1}. We consider the notion of the influence of variables on Boolean functions. The influence of a variable on a...

متن کامل

9-variable Boolean Functions with Nonlinearity 242 in the Generalized Rotation Class

In 2006, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yücel. To improve this nonlinearity result, we have firstly defined some subsets of the n-variable Boolean functions as the “generalized classes of k-RSBFs and k-D...

متن کامل

Balanced Boolean Functions with Nonlinearity > 2 n – 1 – 2

Recently, balanced 15-variable Boolean functions with nonlinearity 16266 were obtained by suitably modifying unbalanced Patterson-Wiedemann (PW) functions, which possess nonlinearity 2–2 + 20 = 16276. In this short paper, we present an idempotent (interpreted as rotation symmetric Boolean function) with nonlinearity 16268 having 15 many zeroes in the Walsh spectrum, within the neighborhood of P...

متن کامل

Construction of Odd-Variable Resilient Boolean Functions with Optimal Degree

In this paper, we investigate the problem of obtaining new construction methods for resilient Boolean functions. Given n (n odd and n ≥ 35), we firstly provide degree optimized 1-resilient n-variable functions with currently best known nonlinearity. Then we extend our method to obtain m-resilient (m > 1) Boolean functions with degree n − m − 1, we show that these Boolean functions also achieve ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Comput. Math.

دوره 92  شماره 

صفحات  -

تاریخ انتشار 2015